The Expressive Power of Abstract-State Machines

Conventional computation models assume symbolic representations of states and actions. Gurevich's Abstract-State Machine model takes a more liberal position: Any mathematical structure may serve as a state. This results in "a computational model that is more powerful and more universal than standard computation models". We characterize the Abstract-State Machine model as a special class of transition systems that widely extends the class of "computable" transition systems. This characterization is based on a fundamental Theorem of Y. Gurevich

06291 Abstracts Collection -- The Role of Business Processes in Service-Oriented Architectures

The Dagstuhl seminar on emph{The Role of Business Processes in Service Oriented Architectures} (Seminar 06291) took place in July 2006 (16.07.2006-21.07.2006 to be precise). The seminar was attended by more than 40 experts from both academia and industry. Unlike most Dagstuhl seminars there was a high participation from industry (in particular from organizations developing software, e.g., IBM, SAP, Microsoft, Google, etc.). The focal point of the seminar was the marriage of business processes and service oriented architectures. This was reflected by the topics selected by the participants and their background

The Generic Model of Computation

Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein.Comment: In Proceedings DCM 2011, arXiv:1207.682

Abstract State Machines for the Classroom

Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and more universal than standard computation models” by Yuri Gurevich in 1985. Here we provide a bunch of intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for an amazingly liberal notion of algorithms is highlighted. Generalizing variants of the fundamental “sequential small step” version of ASM are also considered

Abstract State Machines for the Classroom – The Basics –

... we should have achieved a mathematical model of computation, perhaps highly abstract in contrast with the concrete nature of paper and register machines, but such that programming languages are merely executable fragments of the theory... Robin Milner [17] Summary. Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and more universal than standard computation models ” by Yuri Gurevich in 1985. Here we provide a bunch of intuitive and motivating arguments, and characteristic examples for (the elementary version of) ASM. The intuition of ASM as a formal framework for an amazingly liberal notion of algorithms is highlighted. Generalizing variants of the fundamental “sequential small step ” version of ASM are also considered

Verteilte Algorithmen: Nutzen sie der Forschergruppe?

Peer Reviewe